Interdiction Problems on Planar Graphs

Extensions to Network Flow Interdiction on Planar Graphs

Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networks, pseudo-polynomial algorithms were found for planar networks with a single source and a single sink and without the possibility to remove vertices. In ...

Network flow interdiction on planar graphs

Matching Interdiction

In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such that the weight of a maximum weight matching in the remaining graph is minimized. In this work we introduce the matching interdiction problem and show that it is strongly NP-complete even when the input ...

Parameterized Complexity of Edge Interdiction Problems

We study the parameterized complexity of graph interdiction problems. For an optimization problem on graphs, one can formulate an interdiction problem as a game consisting of two players, namely, an interdictor and an evader, who compete on an objective with opposing interests. In edge interdiction problems, every edge of the input graph has an interdiction cost associated with it and the inter...

Packing Interdiction and Partial Covering Problems

In the Packing Interdiction problem we are given a packing LP together with a separate interdiction cost for each LP variable and a global interdiction budget. Our goal is to harm the LP: which variables should we forbid the LP from using (subject to forbidding variables of total interdiction cost at most the budget) in order to minimize the value of the resulting LP? Interdiction problems on g...